Motzkin Numbers, Central Trinomial Coefficients and Hybrid Polynomials

نویسندگان

  • P. Blasiak
  • K. A. Penson
چکیده

We show that the formalism of hybrid polynomials, interpolating between Hermite and Laguerre polynomials, is very useful in the study of Motzkin numbers and central trinomial coefficients. These sequences are identified as special values of hybrid polynomials, a fact which we use to derive their generalized forms and new identities satisfied by them.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Human and constructive proof of combinatorial identities: an example from Romik

It has become customary to prove binomial identities by means of the method for automated proofs as developed by Petkovšek, Wilf and Zeilberger [12]. In this paper, we wish to emphasize the role of “human” and constructive proofs in contrast with the somewhat lazy attitude of relaying on “automated” proofs. As a meaningful example, we consider the four formulas by Romik [14], related to Motzkin...

متن کامل

Motzkin Paths, Motzkin Polynomials and Recurrence Relations

We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...

متن کامل

The great trinomial hunt

A trinomial is a polynomial in one variable with three nonzero terms, for example P = 6x + 3x − 5. If the coefficients of a polynomial P (in this case 6, 3,−5) are in some ring or field F , we say that P is a polynomial over F , and write P ∈ F [x]. The operations of addition and multiplication of polynomials in F [x] are defined in the usual way, with the operations on coefficients performed i...

متن کامل

On Apéry Numbers and Generalized Central Trinomial Coefficients

, and E0, E1, E2, . . . are Euler numbers. We show that the arithmetic means 1 n ∑n−1 k=0 (2k+1)Ak (n = 1, 2, 3, . . . ) are always integers and conjecture that ∑n−1 k=0 (2k+1)(−1) Ak ≡ 0 (mod n) for every n = 1, 2, 3, . . . . We also investigated generalized central trinomial coefficient Tn(b, c) (with b, c ∈ Z) which is the coefficient of xn in the expansion of (x2 + bx+ c)n. For any positive...

متن کامل

On Sums Related to Central Binomial and Trinomial Coefficients

A generalized central trinomial coefficient Tn(b, c) is the coefficient of x in the expansion of (x+bx+c) with b, c ∈ Z. In this paper we investigate congruences and series for sums of terms related to central binomial coefficients and generalized central trinomial coefficients. The paper contains many conjectures on congruences related to representations of primes by certain binary quadratic f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008